Universal homogeneous Boolean algebras.

Flocks in Universal and Boolean Algebras

We propose the notion of flocks, which formerly were introduced only in based algebras, for any universal algebra. This generalization keeps the main properties we know from vector spaces, e.g. a closure system that extends the subalgebra one. It comes from the idempotent elementary functions, we call “interpolators”, that in case of vector spaces merely are linear functions with normalized coe...

Universal Homogeneous Derivations Of Graded epsilon-Commutative Algebras

Robbins Algebras vs. Boolean Algebras

In the early 1930s, Huntington proposed several axiom systems for Boolean algebras. Robbins slightly changed one of them and asked if the resulted system is still a basis for variety of Boolean algebras. The solution (afirmative answer) was given in 1996 by McCune with the help of automated theorem prover EQP/OTTER. Some simplified and restucturized versions of this proof are known. In our vers...

Boolean Algebras in Visser Algebras

We generalize the double negation construction of Boolean algebras in Heyting algebras, to a double negation construction of the same in Visser algebras (also known as basic algebras). This result allows us to generalize Glivenko’s Theorem from intuitionistic propositional logic and Heyting algebras to Visser’s basic propositional logic and Visser algebras. Mathematics Subject Classification: P...

Imaginaries in Boolean algebras

Given an infinite Boolean algebra B, we find a natural class of ∅-definable equivalence relations EB such that every imaginary element from B is interdefinable with an element from a sort determined by some equivalence relation from EB . It follows that B together with the family of sorts determined by EB admits elimination of imaginaries in a suitable multisorted language. The paper generalize...